https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2987 Wed 11 Apr 2018 16:18:25 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:36150 Tue 18 Feb 2020 10:30:14 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:45878 Tue 06 Dec 2022 08:43:22 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:169 Thu 25 Jul 2013 09:09:47 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:153 Thu 25 Jul 2013 09:09:40 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12013 k). Additionally, we present an improved polynomial-time approximation algorithm for graphs of average degree four.]]> Sat 24 Mar 2018 08:11:34 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:10045 Sat 24 Mar 2018 08:10:14 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12245 Sat 24 Mar 2018 08:08:09 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:10671 Sat 24 Mar 2018 08:07:17 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:16260 Sat 24 Mar 2018 07:54:17 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:16311 Sat 24 Mar 2018 07:53:20 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5981 Sat 24 Mar 2018 07:47:26 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:86 Sat 24 Mar 2018 07:42:15 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24690 log log n), no such result is known for Upper Irredundance. Their complementary versions are constantfactor approximable in polynomial time. All these four versions are APXhard even on cubic graphs.]]> Sat 24 Mar 2018 07:10:53 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24680 0, making it significantly harder than Dominating Set, while it remains hard even on severely restricted special cases, such as cubic graphs (APX-hard), and planar subcubic graphs (NP-hard). We complement our negative results by showing that the problem admits an O(Δ) approximation on graphs of maximum degree Δ, as well as an EPTAS on planar graphs. Along the way, we also derive essentially tight n1−1d upper and lower bounds on the approximability of the related problem Maximum Minimal Hitting Set on d-uniform hypergraphs, generalising known results for Maximum Minimal Vertex Cover.]]> Sat 24 Mar 2018 07:10:51 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:25053 Sat 24 Mar 2018 07:10:44 AEDT ]]>